A specialized branch & bound & cut for Single-Allocation Ordered Median Hub Location problems
نویسندگان
چکیده
منابع مشابه
Ordered Median Hub Location Problems with Capacity Constraints
The Single Allocation Ordered Median Hub Location problem is a recent hub model introduced in [36] that provides a unifying analysis of a wide class of hub location models. In this paper, we deal with the capacitated version of this problem, presenting two formulations as well as some preprocessing phases for fixing variables. In addition, a strengthening of one of these formulations is also st...
متن کاملA branch and cut algorithm for hub location problems with single assignment
The hub location problem with single assignment is the problem of locating hubs and assigning the terminal nodes to hubs in order to minimize the cost of hub installation and the cost of routing the traffic in the network. There may also be capacity restrictions on the amount of traffic that can transit by hubs. The aim of this paper is to investigate polyhedral properties of these problems and...
متن کاملNew formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem
New formulation and a branch-and-cut algorithm for the multiple allocation p-hub median problem Sergio García, Mercedes Landete and Alfredo Marín Septiembre 2011 ISSN 1576-7264 Depósito legal A-646-2000 Abstract This article deals with the uncapacitated multiple allocation phub median problem, where p facilities (hubs) must be located among n available sites in order to minimize the transportat...
متن کاملA Multi-Objective Model to Single-Allocation Ordered Hub Location Problems by Genetic Algorithm
Most of supply chain and Hub location problems involve several conflicting objectives hence requiring a multi-objective formulation. Normally, Multi-objective approaches lead to the maximization of a weighted sum of score functions. Since normalizing these functions and quantifying the weights is not a straightforward process, such approaches are poor in practice. In this research, this difficu...
متن کاملA Compact Linearisation of Euclidean Single Allocation Hub Location Problems
Hub location problems are strategic network planning problems. They formalise the challenge of mutually exchanging shipments between a large set of depots. The aim is to choose a set of hubs (out of a given set of possible hubs) and connect every depot to a hub so that the total transport costs for exchanging shipments between the depots are minimised. In classical hub location problems, the un...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2013
ISSN: 0166-218X
DOI: 10.1016/j.dam.2013.05.035